HOW SAGE HELPS TO IMPLEMENT GOPPA CODES AND THE McELIECE PUBLIC KEY CRYPTO SYSTEM
نویسنده
چکیده
Common cryptographic methods, especially Public Key Crypto Systems, PKCS based on difficulty to factor large integers or to compute the discrete logarithm, commonly deployed today will not resist attacks using quantum computers once these are operational. However, there are alternatives like hash based digital signature schemes, lattice based cryptography, or multivariatequadratic-equations public-key cryptography. Here, we present ways to judiciously implement code based cryptography exemplified by the McEliece PKCS based on Goppa Codes. We will show how the open source computer algebra system SAGE can guide the implementation of the PKCS say on FPGAs.
منابع مشابه
How SAGE helps to implement Goppa Codes and McEliece PKCSs
Common cryptographic methods, especially Public Key Crypto Systems, PKCS based on difficulty to factor large integers or to compute the discrete logarithm, commonly deployed today will not resist attacks using quantum computers once these are operational. However, there are alternatives like hash based digital signature schemes, lattice based cryptography, or multivariate-quadratic-equations pu...
متن کاملGenerating Goppa Codes
Once quantum computers become operational all current public key crypto systems, PKCSs become obsolete. Fortunately, there are alternative quantum computer robust methods based on coding, on hashing, on multivariate polynomials, on lattices etc. One such candidate is the McEliece PKCS which is based on error correcting codes, e.g. Goppa codes. Hence, in order to implement the McEliece PKCS one ...
متن کاملCompact McEliece keys based on quasi-dyadic Srivastava codes
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very large keys, hence recent research has focused mainly on trying to reduce the public key size. Previous proposals tried to replace the class of Goppa codes with other families of codes, but this was revealed to be an ins...
متن کاملWild McEliece Incognito
The wild McEliece cryptosystem uses wild Goppa codes over finite fields to achieve smaller public key sizes compared to the original McEliece cryptosystem at the same level of security against all attacks known. However, the cryptosystem drops one of the confidence-inspiring shields built into the original McEliece cryptosystem, namely a large pool of Goppa polynomials to choose from. This pape...
متن کاملMcEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks
Quantum computers can break the RSA, El Gamal, and elliptic curve public-key cryptosystems, as they can efficiently factor integers and extract discrete logarithms. This motivates the development of post-quantum cryptosystems: classical cryptosystems that can be implemented with today’s computers, that will remain secure even in the presence of quantum attacks. In this article we show that the ...
متن کامل